Flexible Auto-Weighted Local-Coordinate Concept Factorization: A Robust Framework for Unsupervised Clustering
نویسندگان
چکیده
Concept Factorization (CF) and its variants may produce inaccurate representation clustering results due to the sensitivity noise, hard constraint on reconstruction error, pre-obtained approximate similarities. To improve ability, a novel unsupervised Robust Flexible Auto-weighted Local-coordinate (RFA-LCF) framework is proposed for high-dimensional data. Specifically, RFA-LCF integrates robust flexible CF by clean data space recovery, sparse local-coordinate coding, adaptive weighting into unified model. improves representations enhancing robustness of noise errors, providing error optimizing locality jointly. For learning, clearly learns projection recover underlying space, then performed in projected feature space. also uses L2,1-norm based residue encode mismatch between recovered reconstruction, coding represent using few nearby basis concepts. auto-weighting, jointly preserves manifold structures concept new coordinate an manner minimizing errors data, anchor points coordinates. By updating preserving concepts coordinates alternately, abilities can be potentially improved. Extensive public databases show that delivers state-of-the-art compared with other related methods.
منابع مشابه
A Coordinate Descent Method for Robust Matrix Factorization and Applications
Matrix factorization methods are widely used for extracting latent factors for low rank matrix completion and rating prediction problems arising in recommender systems of on-line retailers. Most of the existing models are based on L2 fidelity (quadratic functions of factorization error). In this work, a coordinate descent (CD) method is developed for matrix factorization under L1 fidelity so th...
متن کاملDual-graph regularized concept factorization for clustering
In past decades, tremendous growths in the amount of text documents and images have become omnipresent, and it is very important to group them into clusters upon desired. Recently, matrix factorization based techniques, such as Non-negative Matrix Factorization (NMF) and Concept Factorization (CF), have yielded impressive results for clustering. However, both of them effectively see only the gl...
متن کاملParameter-Free Auto-Weighted Multiple Graph Learning: A Framework for Multiview Clustering and Semi-Supervised Classification
Graph-based approaches have been successful in unsupervised and semi-supervised learning. In this paper, we focus on the real-world applications where the same instance can be represented by multiple heterogeneous features. The key point of utilizing the graph-based knowledge to deal with this kind of data is to reasonably integrate the different representations and obtain the most consistent m...
متن کاملUnsupervised Robust Clustering for Image Database Categorization
Content-based image retrieval can be dramatically improved by providing a good initial database overview to the user. To address this issue, we present in this paper the Adaptive Robust Competition. This algorithm relies on a non-supervised database categorization, coupled with a selection of prototypes in each resulting category. In our approach, each image is represented by a high-dimensional...
متن کاملA Flexible Iterative Framework for Consensus Clustering
A novel framework for consensus clustering is presented which has the ability to determine both the number of clusters and a final solution using multiple algorithms. A consensus similarity matrix is formed from an ensemble using multiple algorithms and several values for k. A variety of dimension reduction techniques and clustering algorithms are considered for analysis. For noisy or high-dime...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2021
ISSN: ['1558-2191', '1041-4347', '2326-3865']
DOI: https://doi.org/10.1109/tkde.2019.2940576